New optimality conditions for multiobjective fuzzy programming problems
Authors
Abstract:
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
similar resources
Optimality conditions for linear programming problems with fuzzy coefficients
The optimality conditions for linear programming problems with fuzzy coefficients are derived in this paper. Two solution concepts are proposed by considering the orderings on the set of all fuzzy numbers. The solution concepts proposed in this paper will follow from the similar solution concept, called the nondominated solution, in the multiobjective programming problem. Under these settings, ...
full textSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
full textA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
full textSufficient Second Order Optimality Conditions for C Multiobjective Optimization Problems
In this work, we use the notion of Approximate Hessian introduced by Jeyakumar and Luc [19], and a special scalarization to establish sufficient optimality conditions for constrained multiobjective optimization problems. Throughout this paper, the data are assumed to be of class C, but not necessarily of class C.
full textOptimality Conditions for Approximate Solutions in Multiobjective Optimization Problems
We study firstand second-order necessary and sufficient optimality conditions for approximate weakly, properly efficient solutions of multiobjective optimization problems. Here, tangent cone, -normal cone, cones of feasible directions, second-order tangent set, asymptotic second-order cone, and Hadamard upper lower directional derivatives are used in the characterizations. The results are first...
full textRelative Pareto minimizers for multiobjective problems: existence and optimality conditions
In this paper we introduce and study enhanced notions of relative Pareto minimizers to constrained multiobjective problems that are defined via several kinds of relative interiors of ordering cones and occupy intermediate positions between the classical notions of Pareto and weak Pareto efficiency /minimality. Using advanced tools of variational analysis and generalized differentiation, we esta...
full textMy Resources
Journal title
volume 17 issue 3
pages 19- 31
publication date 2020-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023